Layout of compound directed graphs

We present a method for the layout of compound directed graphs that is based on the hierarchical layer layout method. Our method has similarities with the method of Sugiyama and Misue (IEEE Trans. Sys., Man, Cybernetics, 21(4), pp. 876-892, 1991) but gives different results: It uses a global partitioning into layers and tries to produce placements of nodes such that border rectangles can be drawn around the nodes of each subgraph. The method is implemented in the VCG tool

Graph layout for applications in compiler construction

We address graph visualization from the viewpoint of compiler construction. Most data structures in compilers are large, dense graphs such as annotated control flow graph, syntax trees, dependency graphs. Our main focus is the animation and interactive exploration of these graphs. Fast layout heuristics and powerful browsing methods are needed. We give a survey of layout heuristics for general directed and undirected graphs and present the browsing facilities that help to manage large structured graph

VCG - visualization of compiler graphs

The VCG tool allows the visualization of graphs that occur typically as data structures in programs. We describe the design concepts of the tool, its specification language and its usage. The tool supports the partitioning of edges and nodes into edge classes and nested subgraphs, the folding of regions, and the management of priorities of edges

VCG - visualization of compiler graphs

The VCG tool allows the visualization of graphs that occur typically as data structures in programs. We describe the design concepts of the tool, its specification language and its usage. The tool supports the partitioning of edges and nodes into edge classes and nested subgraphs, the folding of regions, and the management of priorities of edges

Graph layout for applications in compiler construction

We address graph visualization from the viewpoint of compiler construction. Most data structures in compilers are large, dense graphs such as annotated control flow graph, syntax trees, dependency graphs. Our main focus is the animation and interactive exploration of these graphs. Fast layout heuristics and powerful browsing methods are needed. We give a survey of layout heuristics for general directed and undirected graphs and present the browsing facilities that help to manage large structured graph

Layout of compound directed graphs

We present a method for the layout of compound directed graphs that is based on the hierarchical layer layout method. Our method has similarities with the method of Sugiyama and Misue (IEEE Trans. Sys., Man, Cybernetics, 21(4), pp. 876-892, 1991) but gives different results: It uses a global partitioning into layers and tries to produce placements of nodes such that border rectangles can be drawn around the nodes of each subgraph. The method is implemented in the VCG tool

Generation of distributed supervisors for parallel compilers

This paper presents a new approach towards solving the combination and communication problems between different compiler tasks. As optimizations may generate as well as destroy application conditions of other tasks a carefully chosen application order is important for the effectiveness of the compiler system. Each task is solved by exactly one implementation (engine) and is characterized by its input-output behaviour and an optional heuristics. The specification of all tasks in this manner allows the generation of distributed supervisors for the whole compilation system. The result is a clear semantics of the compiler behaviour during compilation and the separation of algorithm and communication. Software engineering advantages are the easy integration of independently developed parts and the reusability of code. The flexibility of such a compiler system results in high portability even across hardware architectures and topologies

Forgivingness of an Anteromedially Positioned Small Locked Plate for High Tibial Osteotomy in Case of Overcorrection and Lateral Hinge Fracture

High tibial osteotomy (HTO) represents a sensible treatment option for patients with moderate unicondylar osteoarthritis of the knee and extraarticular malalignment. The possibility of a continuously variable correction setting and a surgical approach low in complications has meant that the medial opening osteotomy has prevailed over the past decades. The objective of the present study was to determine whether anteromedially positioned small plates are nevertheless forgiving under biomechanically unfavourable conditions (overcorrection and lateral hinge fracture). In this study, a simulated HTO was performed on composite tibiae with a 10-mm wedge and fixed-angle anteromedial osteosynthesis with a small implant. Force was applied axially in a neutral mechanical axis, a slight and a marked overcorrection into valgus, with and without a lateral hinge fracture in each case. At the same time, a physiological gait with a dual-peak force profile and a peak load of 2.4 kN was simulated. Interfragmentary motion and rigidity were determined. The rigidity of the osteosynthesis increased over the cycles investigated. A slight overcorrection into valgus led to the lowest interfragmentary motion, compared with pronounced valgisation and neutral alignment. A lateral hinge fracture led to a significant decrease in rigidity and increase in interfragmentary motion. However, in no case was the limit of 1 mm interfragmentary motion critical for osteotomy healing exceeded. The degree of correction of the leg axis, and the presence of a lateral hinge fracture, have an influence on rigidity and interfragmentary motion. From a mechanically neutral axis ranging up to pronounced overcorrection, the implant investigated offers sufficient stability to allow healing of the osteotomy, even if a lateral hinge fracture is present

Microbiological evaluation of a new growth-based approach for rapid detection of methicillin-resistant Staphylococcus aureus

OBJECTIVES: Recently, a rapid screening tool for methicillin-resistant Staphylococcus aureus (MRSA) has been introduced that applies a novel detection technology allowing the rapid presence or absence of MRSA to be determined from an enrichment broth after only a few hours of incubation. To evaluate the reliability of this new assay to successfully detect MRSA strains of different origin and clonality, well-characterized S. aureus strains were tested in this study. METHODS: More than 700 methicillin-susceptible and methicillin-resistant strains covering >90% of all registered European MRSA spa types within the SeqNet network were studied. RESULTS: All 513 MRSA strains tested were recognized as methicillin-resistant: among these, 96 MRSA strains were from an institutional collection, each presenting a unique spa type. None of the 211 methicillin-susceptible strains were detected as positive. CONCLUSIONS: The new growth-based rapid MRSA assay was shown to detect without exception all MRSA strains of large collections of strains comprising highly diverse genetic backgrounds, indicating that such a phenotypic test might be potentially more likely to cope with new strains

Computational comparisons of model genomes

Complete genomes from model organisms provide new challenges for computational molecular biology. Novel questions emerge from the genome data obtained from the functional prediction of thousands of gene products. In this review, we present some approaches to the computational comparison of genomes, based on sequence and text analysis, and comparisons of genome composition and gene order. With the recent publication of the complete genome sequences from two bacteria, Haemophilus injuenzae Rdi and Mycoplasma genitalium2, new challenges are emerging for computational biology. Two such challenges are (1) to predict and annotate the fimctions of the gene products as rapidly and completely as possible, and (2) to derive adequate abstractions that make genomes comparable at a higher-than-molecular level